Randomness and Pseudo-Randomness in Discrete Mathematics
نویسنده
چکیده
The discovery, demonstrated in the early work of Paley, Zygmund, Erdős, Kac, Turán, Shannon, Szele and others, that deterministic statements can be proved by probabilistic reasoning, led already in the first half of the century to several striking results in Analysis, Number Theory, Combinatorics and Information Theory. It soon became clear that the method, which is now called the probabilistic method, is a very powerful tool for proving results in Discrete Mathematics. The early results combined combinatorial arguments with fairly elementary probabilistic techniques, whereas the development of the method in recent years required the application of more sophisticated tools from probability. The books [10], [54] are two recent texts dealing with the subject. Most probabilistic proofs are existence, non-constructive arguments. The rapid development of theoretical Computer Science, and its tight connection to Combinatorics, stimulated the study of the algorithmic aspects of these proofs. In a typical probabilistic proof, one establishes the existence of a combinatorial structure satisfying certain properties by considering an appropriate probability space of structures, and by showing that a randomly chosen point of this space is, with positive probability, a structure satisfying the required properties. Can we find such a structure efficiently, that is, by a (deterministic or randomized) polynomial time algorithm ? In several cases the probabilistic proof provides such a randomized efficient algorithm, and in other cases the task of finding such an algorithm requires additional ideas. Once an efficient randomized algorithm is found, it is sometimes possible to derandomize it and convert it into an efficient deterministic one. To this end, certain explicit pseudo-random structures are needed, and their construction often requires tools from a wide variety of mathematical areas including Group Theory, Number Theory and Algebraic Geometry. The application of probabilistic techniques for proving deterministic theorems, and the application of deterministic theorems for derandomizing probabilistic existence proofs, form an interesting combination of mathematical ideas from various areas, whose intensive study in recent years led to the development of fascinating techniques. In this paper I survey some of these developments and mention several related open problems. ∗Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. Email: [email protected]. Research supported in part by a USA Israeli BSF grant and by the Fund for Basic Research administered by the Israel Academy of Sciences.
منابع مشابه
TESTING FOR “RANDOMNESS” IN SPATIAL POINT PATTERNS, USING TEST STATISTICS BASED ON ONE-DIMENSIONAL INTER-EVENT DISTANCES
To test for “randomness” in spatial point patterns, we propose two test statistics that are obtained by “reducing” two-dimensional point patterns to the one-dimensional one. Also the exact and asymptotic distribution of these statistics are drawn.
متن کاملA DHT Based Measure of Randomness
This paper presents a new discrete Hilbert transform (DHT) based measure of randomness for discrete sequences. The measure has been used to test three different classes of sequences with satisfactory results. Introduction Random numbers are used in different fields as in cryptography for generating encryption keys, in simulating and modeling complex phenomena and for selecting random samples fr...
متن کاملDynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration
To reduce randomness drastically in Monte Carlo (MC) integration, we propose a pairwise independent sampling, the dynamic random Weyl sampling (DRWS). DRWS is applicable even if the length of random bits to generate a sample may vary. The algorithm of DRWS is so simple that it works very fast, even though the pseudo-random generator, the source of randomness, might be slow. In particular, we ca...
متن کاملBook Review: Inevitable Randomness in Discrete Mathematics by József Beck
The beauty and utility of randomness is more than matched by its mysteries. How can we tell if a putative source of randomness (such as the frequency of the emission of electrons from a decaying radioactive material) is truly random? Indeed, how does one define randomness? Starting from the 17th century work of Pascal and Fermat, and spurred on by the 20th century axiomatic approaches of S. N. ...
متن کاملA Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملMathematical foundations of modern cryptography: computational complexity perspective
Theoretical computer science has found fertile ground in many areas of mathematics. The approach has been to consider classical problems through the prism of computational complexity, where the number of basic computational steps taken to solve a problem is the crucial qualitative parameter. This new approach has led to a sequence of advances, in setting and solving new mathematical challenges ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002